/*************************************************************************
 * File Name:    Reverse_Integer.cc
 * Author:       zero91
 * Mail:         jianzhang9102@gmail.com
 * Created Time: 2013/11/6 22:35:41
 * 
 * Description:  
 |------------------------------------------------------------------------
 | Problem: Reverse Integer
 | Reverse digits of an integer.
 |
 | Example1: x = 123, return 321
 | Example2: x = -123, return -321
 |
 | click to show spoilers.
 |
 | Have you thought about this?
 | Here are some good questions to ask before coding. Bonus points for you
 | if you have already thought through this!
 |
 | If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
 |
 | Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer,
 | then the reverse of 1000000003 overflows. How should you handle such cases?
 |
 | Throw an exception? Good, but what if throwing an exception is not an option?
 | You would then have to re-design the function (ie, add an extra parameter).
 |------------------------------------------------------------------------
 ************************************************************************/

#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>

using namespace std;

class Solution {
public:
    int reverse(int x)
    {
        bool negative = x < 0;
        char num[20];
        
        x = abs(x);
        long long ans = 0;
        while (x != 0) {
            ans = ans * 10 + x % 10;
            x /= 10;
        }
        if (negative) ans = -ans;
        if (ans > INT_MAX) return INT_MAX;
        if (ans < INT_MIN) return INT_MIN;
        return ans;
    }
};

